Search results for "Predicate logic"
showing 10 items of 170 documents
Removing the saturation assumption in Bank-Weiser error estimator analysis in dimension three
2020
International audience; We provide a new argument proving the reliability of the Bank-Weiser estimator for Lagrange piecewise linear finite elements in both dimension two and three. The extension to dimension three constitutes the main novelty of our study. In addition, we present a numerical comparison of the Bank-Weiser and residual estimators for a three-dimensional test case.
Restricted compositions and permutations: from old to new Gray codes
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…
Approximate treatment of higher excitations in coupled-cluster theory. II. Extension to general single-determinant reference functions and improved a…
2008
The theory and implementation of approximate coupled-cluster (CC), in particular approximate CC singles, doubles, triples, and quadruples methods, are discussed for general single-determinant reference functions. While the extension of iterative approximate models to the non-Hartree-Fock case is straightforward, the generalization of perturbative approaches is not trivial. In contrast to the corresponding perturbative triples methods, there are additional terms required for non-Hartree-Fock reference functions, and there are several possibilities to derive approximations to these terms. As it turns out impossible to develop an approach that is consistent with the canonical Hartree-Fock-base…
An effective extension of the applicability of alignment-free biological sequence comparison algorithms with Hadoop
2016
Alignment-free methods are one of the mainstays of biological sequence comparison, i.e., the assessment of how similar two biological sequences are to each other, a fundamental and routine task in computational biology and bioinformatics. They have gained popularity since, even on standard desktop machines, they are faster than methods based on alignments. However, with the advent of Next-Generation Sequencing Technologies, datasets whose size, i.e., number of sequences and their total length, is a challenge to the execution of alignment-free methods on those standard machines are quite common. Here, we propose the first paradigm for the computation of k-mer-based alignment-free methods for…
Attention-based Model for Evaluating the Complexity of Sentences in English Language
2020
The automation of text complexity evaluation (ATCE) is an emerging problem which has been tackled by means of different methodologies. We present an effective deep learning- based solution which leverages both Recurrent Neural and the Attention mechanism. The developed system is capable of classifying sentences written in the English language by analysing their syntactical and lexical complexity. An accurate test phase has been carried out, and the system has been compared with a baseline tool based on the Support Vector Machine. This paper represents an extension of a previous deep learning model, which allows showing the suitability of Neural Networks to evaluate sentence complexity in tw…
The periodic rural postman problem with irregular services on mixed graphs
2019
Abstract In this paper, we deal with an extension of the rural postman problem in which some links of a mixed graph must be traversed a given number of times over a time horizon. These links represent entities that must be serviced a specified number of times in some subsets of days (or periods) of the time horizon. The aim is to design a set of minimum-cost tours, one for each day/period of the time horizon, that satisfy the service requirements. We refer to this problem as the periodic rural postman problem with irregular services (PRPP–IS). Some practical applications of the problem can be found in road maintenance operations and road network surveillance, for example. In order to solve …
On the existence of at least a solution for functional integral equations via measure of noncompactness
2017
In this article, we use fixed-point methods and measure of noncompactness theory to focus on the problem of establishing the existence of at least a solution for the following functional integral equation ¶ \[u(t)=g(t,u(t))+\int_{0}^{t}G(t,s,u(s))\,ds,\quad t\in{[0,+\infty[},\] in the space of all bounded and continuous real functions on $\mathbb{R}_{+}$ , under suitable assumptions on $g$ and $G$ . Also, we establish an extension of Darbo’s fixed-point theorem and discuss some consequences.
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
2017
[EN] The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods. If the vehicle gets closer than a certain distance to a meter, the receiver is able to record the gas, water, or electricity consumption. Therefore, the vehicle does not need to traverse every street, but only a few, to get close enough to each meter. We study an extension of this problem in which a fleet of vehicles is available. Given the characteristics of the mentioned application, the vehicles have no capacities but there is a maximum distan…